SQUARE q , t - LATTICE PATHS AND ∇ ( p n ) NICHOLAS A

نویسندگان

  • NICHOLAS A. LOEHR
  • GREGORY S. WARRINGTON
چکیده

The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and studied extensively by Haglund, Haiman, Garsia, Loehr, and others. The q, t-Catalan numbers, besides having many subtle combinatorial properties, are intimately connected to symmetric functions, algebraic geometry, and Macdonald polynomials. In particular, the n’th q, t-Catalan number is the Hilbert series for the module of diagonal harmonic alternants in 2n variables; it is also the coefficient of s1n in the Schur expansion of ∇(en). Using q, t-analogues of labelled Dyck paths, Haglund et al. have proposed combinatorial conjectures for the monomial expansion of ∇(en) and the Hilbert series of the diagonal harmonics modules. This article extends the combinatorial constructions of Haglund et al. to the case of lattice paths contained in squares. We define and study several q, t-analogues of these lattice paths, proving combinatorial facts that closely parallel corresponding results for the q, t-Catalan polynomials. We also conjecture an interpretation of our combinatorial polynomials in terms of the nabla operator. In particular, we conjecture combinatorial formulas for the monomial expansion of ∇(pn), the “Hilbert series” 〈∇(pn), h1n 〉, and the sign character 〈∇(pn), s1n 〉.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SQUARE q , t - LATTICE PATHS AND ∇ ( p n ) NICHOLAS

The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and studied extensively by Haglund, Haiman, Garsia, Loehr, and others. The q, t-Catalan numbers, besides having many subtle combinatorial properties, are intimately connected to symmetric functions, algebraic geometry, and Macdonald polynomials. In particular, the n’th q, t-Catalan number is the Hilb...

متن کامل

SQUARE q , t - LATTICE PATHS AND ∇ ( p n )

The combinatorial q, t-Catalan numbers are weighted sums of Dyck paths introduced by J. Haglund and studied extensively by Haglund, Haiman, Garsia, Loehr, and others. The q, t-Catalan numbers, besides having many subtle combinatorial properties, are intimately connected to symmetric functions, algebraic geometry, and Macdonald polynomials. In particular, the n’th q, t-Catalan number is the Hilb...

متن کامل

A proof of the q, t-square conjecture

1. the weighted sum of all Dyck paths of order n, weighted by area and bounce score; 2. the Hilbert series of the module of diagonal harmonic alternants of order n; 3. the n’th Garsia-Haiman q, t-Catalan number, which is a certain sum of complicated rational functions constructed from partitions; 4. the coefficient of the sign character in∇(en), where∇ is the Bergeron-Garsia nabla operator [1, ...

متن کامل

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

Generalizing Delannoy Numbers via Counting Weighted Lattice Paths

The aim of this paper is to introduce a generalization of Delannoy numbers. The standard Delannoy numbers count lattice paths from (0, 0) to (n, k) consisting of horizontal (1, 0), vertical (0, 1), and diagonal (1, 1) steps called segments. We assign weights to the segments of the lattice paths, and we sum weights of all lattice paths from any (a, b) to (n, k). Generating functions for the gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006